New Results on Cryptanalysis of Stream Ciphers
نویسنده
چکیده
Stream ciphers are cryptographic primitives that ensure the confidentiality of communications. In this thesis, we study several attacks on stream ciphers. For practical applications, the candidates of stream ciphers of NESSIE and eSTREAM projects are scrutinized. Firstly, the algebraic attacks on SOBER-t32 and SOBER-t16 stream ciphers are performed under the assumption that the stuttering phases are not considered. In particular, our attack demonstrates that the fast algebraic attack can improve the efficiency of the algebraic attack significantly by reducing the degree of nonlinear algebraic equations with annihilators. Next, a linear distinguishing attack is presented against SOBER-128 which is a strengthened version of SOBER-t32. We observe that there is a highly biased approximation in the filter function which can be combined with the linearity of the shift register. In addition, we show that it is possible to improve the complexity of the attack by using a quadratic equation. Following this, a new type of linear distinguishing attack is applied to the NLS stream cipher. This attack demonstrates that a linear attack can be extended to stream ciphers based on a nonlinear shift register and a nonlinear filter function. The attack on NLS is extended to NLSv2 which is a tweaked version of NLS. In this attack, we show that certain combinations of multiple modular additions retain highly biased linear approximations. Finally, a distinguishing attack on the Dragon stream cipher is presented. Though this attack is far away from being practical, our attack shows that basic components of Dragon are not correlation immune. Statement of Candidate This thesis is submitted in fulfillment of the requirements of the Doctor of Philosophy at Macquarie University and has not been submitted for a higher degree to any other university or institution. This thesis represents my original work and contributions.
منابع مشابه
A new method for accelerating impossible differential cryptanalysis and its application on LBlock
Impossible differential cryptanalysis, the extension of differential cryptanalysis, is one of the most efficient attacks against block ciphers. This cryptanalysis method has been applied to most of the block ciphers and has shown significant results. Using structures, key schedule considerations, early abort, and pre-computation are some common methods to reduce complexities of this attack. In ...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملCryptanalysis and Design of Stream Ciphers
This thesis presents some novel results on the cryptanalysis and design of stream ciphers. The first part of the thesis introduces various stream ciphers design and cryptanalysis techniques. The second part of the thesis gives the cryptanalysis of seven stream ciphers. The properties of addition are exploited in the cryptanalysis of two stream ciphers: the differential-linear cryptanalysis agai...
متن کاملDifferential Cryptanalysis of the Stream Ciphers Py, Py6 and Pypy
A multi-year project to identify new stream ciphers that might become suitable for widespread adoption
متن کاملImpossible Differential Cryptanalysis of Reduced-Round Midori64 Block Cipher (Extended Version)
Impossible differential attack is a well-known mean to examine robustness of block ciphers. Using impossible differ- ential cryptanalysis, we analyze security of a family of lightweight block ciphers, named Midori, that are designed considering low energy consumption. Midori state size can be either 64 bits for Midori64 or 128 bits for Midori128; however, both vers...
متن کاملBiclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity
In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...
متن کامل